A real QZ algorithm for structured companion pencils

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Scaling of Companion Pencils for the QZ-Algorithm∗†

Computing roots of a monic polynomial may be done by computing the eigenvalues of the corresponding companion matrix using for instance the well-known QR-algorithm. We know this algorithm to be backward stable since it computes exact eigenvalues of a slightly modified matrix. But it may yield very poor backward errors in the coefficients of the polynomial. In this paper we investigate what can ...

متن کامل

A note on companion pencils

Various generalizations of companion matrices to companion pencils are presented. Companion matrices link to monic polynomials, whereas companion pencils do not require monicity of the corresponding polynomial. In the classical companion pencil case (A,B) only the coefficient of the highest degree appears in B’s lower right corner. We will show, however, that all coefficients of the polynomial ...

متن کامل

A Structured Staircase Algorithm for Skew-symmetric/symmetric Pencils

A STRUCTURED STAIRCASE ALGORITHM FOR SKEW-SYMMETRIC/SYMMETRIC PENCILS RALPH BYERS , VOLKER MEHRMANN , AND HONGGUO XU Abstract. We present structure preserving algorithms for the numerical computation of structured staircase forms of skew-symmetric/symmetric matrix pencils along with the Kronecker indices of the associated skew-symmetric/symmetric Kronecker-like canonical form. These methods all...

متن کامل

Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils

Recently the Jacobi–Davidson subspace iteration method has been introduced as a new powerful technique for solving a variety of eigenproblems. In this paper we will further exploit this method and enhance it with several techniques so that practical and accurate algorithms are obtained. We will present two algorithms, JDQZ for the generalized eigenproblem and JDQR for the standard eigenproblem,...

متن کامل

Classifying Real Polynomial Pencils

Let RP be the space of all homogeneous polynomials of degree n in two variables with real coefficients. The standard discriminant Dn+1 ⊂ RP n is Whitney stratified according to the number and the multiplicities of multiple real zeros. A real polynomial pencil, that is, a line L ⊂ RP is called generic if it intersects Dn+1 transversally. Nongeneric pencils form the Grassmann discriminant D2,n+1 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Calcolo

سال: 2017

ISSN: 0008-0624,1126-5434

DOI: 10.1007/s10092-017-0231-6